Obstruction Sets for Outer-Projective-Planar Graphs
نویسندگان
چکیده
A graph G is outer projective planar if it can be embedded in the projective plane so that every vertex appears on the boundary of a single face We exhibit obstruction sets for outer projective planar graphs with respect to the subdivision minor and Y orderings Equivalently we nd the minimal non outer projective planar graphs under these orderings
منابع مشابه
$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملHall-Type Results for 3-Connected Projective Graphs
4 Projective planar graphs can be characterized by a set A of 35 excluded minors. However, 5 these 35 are not equally important. A set E of 3-connected members of A is excludable if there 6 are only finitely many 3-connected non-projective planar graphs that do not contain any graph 7 in E as a minor. In this paper we show that there are precisely two minimal excludable sets, 8 which have sizes...
متن کاملObstruction sets for outer-cylindrical graphs
A graph is outer-cylindrical if it embeds in the sphere so that there are two distinct faces whose boundaries together contain all the vertices. The class of outer-cylindrical graphs is closed under minors. We give the complete set of 38 minor-minimal non-outer-cylindrical graphs, or equivalently, an excluded minor characterization of outercylindrical graphs. We also give the obstruction sets u...
متن کاملPlanar graphs on the projective plane
It is shown that embeddings of planar graphs in the projective plane have very specific structure. By exhibiting this structure we indirectly characterize graphs on the projective plane whose dual graphs are planar. Whitney's Theorem about 2-switching equivalence of planar embeddings is generalized: Any two embeddings of a planar graph in the projective plane can be obtained from each other by ...
متن کاملInternally 4-connected projective-planar graphs
5 Archdeacon proved that projective-planar graphs are characterized by 35 excluded minors. 6 Using this result we show that internally 4-connected projective-planar graphs are characterized 7 by 23 internally 4-connected excluded minors. 8
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 49 شماره
صفحات -
تاریخ انتشار 1998